Embedding simple commutative monoids into simple refinement monoids
نویسندگان
چکیده
Say that a cone is a commutative monoid that is in addition conical, i.e., satisfies x+y=0 ⇒ x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind, satisfying in addition various divisibility conditions. We do this in particular for all cones, or for all separative cones, or for all cancellative cones (positive cones of partially ordered abelian groups). We also settle both the torsion-free case and the unperforated case. Most of our results extend to arbitrary commutative monoids.
منابع مشابه
Finitely generated antisymmetric graph monoids
A graph monoid is a commutative monoid for which there is a particularly simple presentation, given in terms of a quiver. Such monoids are known to satisfy various nonstable K-theoretical representability properties for either von Neumann regular rings or C*-algebras. We give a characterization of graph monoids within finitely generated antisymmetric refinement monoids. This characterization is...
متن کاملOn Regularity of Acts
In this article we give a characterization of monoids for which torsion freeness, ((principal) weak, strong) flatness, equalizer flatness or Condition (E) of finitely generated and (mono) cyclic acts and Condition (P) of finitely generated and cyclic acts implies regularity. A characterization of monoids for which all (finitely generated, (mono) cyclic acts are regular will be given too. We als...
متن کاملSequential grammars and automata with valences
We discuss the model of valence grammars, a simple extension of context-free grammars. We show closure properties of context-free valence languages over arbitrary monoids. Chomsky and Greibach normal form theorems and an iteration lemma for context-free valence grammars over the groups Z are proved. The generative power of di4erent control monoids is investigated. In particular, we show that co...
متن کاملOn Graphs With a Given
On Graphs With A Given Endomorphism Monoid Benjamin Shemmer Hedrĺın and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M. We will give a construction G(M) for a graph with prescribed endomorphism monoid M. Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism mo...
متن کاملModel Structures on Commutative Monoids in General Model Categories
We provide conditions on a monoidal model categoryM so that the category of commutative monoids in M inherits a model structure from M in which a map is a weak equivalence or fibration if and only if it is so inM. We then investigate properties of cofibrations of commutative monoids, rectification between E∞-algebras and commutative monoids, the relationship between commutative monoids and mono...
متن کامل